ESTIMATION FOR NONNEGATIVE AUTOREGRESSIVE PROCESSES WITH AN UNKNOWN LOCATION PARAMETER

Abstract. Consider an AR(1) process given by X ^t=γ+ø X _t+ Z _t≥ 1. where 0 ≤γ, 0 ≤ø 1 are unknown parameters and the innovations Z _t, ≥ 1, are independently and identically distributed positive random variables. We propose estimates of (γø) which are obtained as the solution to a linear programming problem and establish their strong consistency. When the Z _ts have the exponential distribution. our estimate becomes the conditional maximum likelihood estimate given X ₀. Under the assumption of regular variation of the innovation distribution at its left and right endpoints (assumed to be 0 and ∝ respectively), we establish asymptotic limit laws for the estimates. Consistent estimators for a class of moving-average processes with heavy-tailed innovation distribution are also presented.     

Encapsulation and controlled release in polyacrylamide hydrogels

A novel host–guest system was developed by the encapsulation of simple organic guest molecules in the hydrophilic molecular architecture of crosslinked polyacrylamide hydrogels. The crosslinking agents used for the preparation of the host systems were hexanediol dimethacrylate (HDDMA) and divinyl benzene (DVB). This enabled us to construct hydrogels with different hydrophobic–hydrophilic equilibria. The model guest system used for the studies was benzoic acid. The selections gave simple but excellent host–guest systems with fine polar–apolar balancing. Polyacrylamide hydrogels with encapsulated benzoic acid were prepared with varying crosslink densities (5, 10, 15, and 20 mol %) by the solution polymerization technique. The rate of release of the host from the host–guest assembly was studied in different swelling conditions. The rate of release depended on the interaction forces between the polymer and the solvents. Polar forces, dispersion forces, and hydrogen bonding all played a vital role. The swelling behavior of the host‐polymer system and the host–guest assembly was analyzed and compared by the Flory–Rehner method. The amount of benzoic acid encapsulated in the DVB‐crosslinked polymer was higher than in the HDDMA‐crosslinked polymer, and the rate of release was in the order 5 > 15 > 10 > 20% for the DVB‐crosslinked polymer. The rate of release for the HDDMA‐crosslinked host–guest assembly was in the order 10 > 5 > 15 > 20%. These results were in excellent agreement with those of the Flory–Rehner analysis of the swelling properties. © 2004 Wiley Periodicals, Inc. J Appl Polym Sci 93: 1816–1824, 2004     

Using maleic anhydride grafted poly(lactic acid) as a compatibilizer in poly(lactic acid)/layered‐silicate nanocomposites

The goal of this work was to prepare exfoliated poly(lactic acid) (PLA)/layered‐silicate nanocomposites with maleic anhydride grafted poly(lactic acid) (PLA–MA) as a compatibilizer. Two different layered silicates were used in the study: bentonite and hectorite. The nanocomposites were prepared by the incorporation of each layered silicate (5 wt %) into PLA via solution casting. X‐ray diffraction of the prepared nanocomposites indicated exfoliation of the silicates. However, micrographs from transmission electron microscopy showed the presence of intercalated and partially exfoliated areas. Tensile testing showed improvements in both the tensile modulus and yield strength for all the prepared nanocomposites. The results from the dynamic mechanical thermal analysis showed an improvement in the storage modulus over the entire temperature range for both layered silicates together with a shift in the tan δ peak to higher temperatures. The effect of using PLA–MA differed between the two layered silicates because of a difference in the organic treatment. The bentonite layered silicate showed a more distinct improvement in exfoliation and an increase in the mechanical properties because of the addition of PLA–MA in comparison with the hectorite layered silicate. © 2006 Wiley Periodicals, Inc. J Appl Polym Sci 102: 1852–1862, 2006     

Thermal stability of polyaniline

Thermal stability data for neutral (emeraldine base) and doped polyaniline with various counter anions are reported. The emeraldine base is a highly heat-stable polymer, with thermal stability up to 420 °C. The thermal stability of doped polyaniline is dependent on the counter anion. The methane sulfonic acid doped polyaniline is stable up to 250 °C. The decomposition of the doped polyaniline is seen as a two-step process. The first step is the loss of the dopant and the second step corresponds to the decomposition of the backbone.     

On hypercube packings,blocking sets and a covering problem

Consider sets S of hypercubes of side 2 in the discrete n-dimensional torus of side 4 with the property that every possible hypercube of side 2 has a nonempty intersection with some hypercube in S. The problem of minimizing the size of S is studied in two settings, depending on whether intersections between hypercubes in S are allowed or not. If intersections are not allowed, then one is asking for the smallest size of a non-extensible packing S  ; this size is denoted by f(n)$f(n)$. If intersections are allowed, then the structure S is called a blocking set. The smallest size of a blocking set S   is denoted by h(n)$h(n)$. By computer-aided techniques, it is shown that f(5)=12$f(5)=12$, f(6)=16$f(6)=16$, h(6)=15$h(6)=15$ and h(7)≤23$h(7)\le 23$. Also, non-extensible packings as well as blocking sets of certain small sizes are classified for n≤6$n\le 6$. There is a direct connection between these problems and a covering problem originating from the football pools.     

Column and batch reactive transport experiment parameter estimation using a genetic algorithm

This paper focuses on the application of a genetic algorithm (GA) in estimating the fate and transport parameters of a reacting solute from the column and batch experiments involving a saturated porous medium. A program is developed using C++ to model the column and batch data using kinetically controlled one- or two-site sorption models including linear and/or nonlinear forms. The objective of the algorithm is to minimize the sum of squared differences between the measured and modeled solute concentration data associated with column effluent (i.e., “breakthrough curves”). The GA is capable of estimating transport and reactions parameters such as forward and reverse reaction rates and parameters of the nonlinear reaction models, from a given set of measured data. Further simulations have been performed to estimate the appropriate configurations of the GA, which assist the method in estimating the fate and transport parameters more efficiently. It is shown that a wide range of the GA parameters can lead to convergence to appropriate estimations. The results obtained from this study show that the capability of GAs to fit the column and batch experiment data is promising.     

Evaluation of Nd:YAG-pumped Raman shifter as a broad-spectrum light source

We have examined the utility of a gas-filled, Nd:YAG-laser-pumped Raman shifter as a possible broad-spectrum light source. Six to nine new output frequencies with pulse energies above 1 μJ are produced when a pure-hydrogen or pure-methane Raman shifter is pumped with 40 mJ of secondharmonic, 20 mJ of third-harmonic, or 11 mJ of fourth-harmonic pump pulse energy. Optimum output occurs at pressures of approximately 10 atm for the pure-gas experiments. We also report the output frequencies and pulse energies of a mixed hydrogen-methane Raman shifter pumped by 20 mJ of the third harmonic of the laser for various proportions of the two gases at pressures up to nearly 20 atm. Depending on composition and pressure, over a dozen new output lines with pulse energies over 1 μJ can be produced. We discuss the nonlinear processes involved, the optimum operating conditions, and the suitability of the source for our application of groundwater monitoring.     

Energy optimization for CAN bus and media controls in electric vehicles using deep learning algorithms

The Journal of Supercomputing - This study offers a neural network-based deep learning method for energy optimization modeling in electric vehicles (EV). The pre-processed driving cycle is...     

Symmetry in scalar field topology

Study of symmetric or repeating patterns in scalar fields is important in scientific data analysis because it gives deep insights into the properties of the underlying phenomenon. Though geometric symmetry has been well studied within areas like shape processing, identifying symmetry in scalar fields has remained largely unexplored due to the high computational cost of the associated algorithms. We propose a computationally efficient algorithm for detecting symmetric patterns in a scalar field distribution by analysing the topology of level sets of the scalar field. Our algorithm computes the contour tree of a given scalar field and identifies subtrees that are similar. We define a robust similarity measure for comparing subtrees of the contour tree and use it to group similar subtrees together. Regions of the domain corresponding to subtrees that belong to a common group are extracted and reported to be symmetric. Identifying symmetry in scalar fields finds applications in visualization, data exploration, and feature detection. We describe two applications in detail: symmetry-aware transfer function design and symmetry-aware isosurface extraction.     

Geometric Representation of Graphs in Low Dimension Using Axis Parallel Boxes

An axis-parallel k-dimensional box is a Cartesian product R ₁×R ₂×???×R _k where R _i (for 1≤i≤k) is a closed interval of the form [a _i ,b _i ] on the real line. For a graph G, its boxicity box?(G) is the minimum dimension k, such that G is representable as the intersection graph of (axis-parallel) boxes in k-dimensional space. The concept of boxicity finds applications in various areas such as ecology, operations research etc. A number of NP-hard problems are either polynomial time solvable or have much better approximation ratio on low boxicity graphs. For example, the max-clique problem is polynomial time solvable on bounded boxicity graphs and the maximum independent set problem for boxicity d graphs, given a box representation, has a $\lfloor 1+\frac{1}{c}\log n\rfloor^{d-1}An axis-parallel k-dimensional box is a Cartesian product R ₁×R ₂×⋅⋅⋅×R _k where R _i (for 1≤i≤k) is a closed interval of the form [a _i ,b _i ] on the real line. For a graph G, its boxicity box (G) is the minimum dimension k, such that G is representable as the intersection graph of (axis-parallel) boxes in k-dimensional space. The concept of boxicity finds applications in various areas such as ecology, operations research etc. A number of NP-hard problems are either polynomial time solvable or have much better approximation ratio on low boxicity graphs. For example, the max-clique problem is polynomial time solvable on bounded boxicity graphs and the maximum independent set problem for boxicity d graphs, given a box representation, has a ?1+\frac1clogn?^d-1\lfloor 1+\frac{1}{c}\log n\rfloor^{d-1} approximation ratio for any constant c≥1 when d≥2. In most cases, the first step usually is computing a low dimensional box representation of the given graph. Deciding whether the boxicity of a graph is at most 2 itself is NP-hard.